Path decomposition - PDFSEARCH.IO - Document Search Engine

Path decomposition
Results: 318

#	Item
261	Topics in Graph Theory — Lecture Notes I (Tuesday) 1. Basics: Graphs and Spanning Trees Notation: G = (V, E) means that G is a graph with vertices V and edges E. Each edge e has either one Add to Reading List Source URL: www.math.ku.edu Language: English - Date: 2004-08-10 22:04:59 Algebraic graph theory Tree Laplacian matrix Edge contraction Graph Path decomposition Adjacency matrix Graph theory Mathematics Spanning tree
262	A System for Graph-Based Visualization of the Evolution of Software Christian Collberg1∗ Add to Reading List Source URL: www.researchgate.net Language: English Force-based algorithms Graph Call graph Adjacency matrix Path decomposition Directed acyclic graph Graph theory Mathematics Graph drawing
263	This paper is a revised version of a submission to ICFP’10. Please refer to the version by the four words in the footer after MD5:. Hoopl: A Modular, Reusable Library for Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2010-04-06 10:37:26 Static single assignment form Data-flow analysis Depth-first search Graph Antiderivative Graph operations Path decomposition Topology Graph theory Mathematics Compiler construction
264	Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs Cyril Gavoille and Arnaud Labourel Add to Reading List Source URL: dept-info.labri.fr Language: English - Date: 2007-08-07 09:06:34 Universal graph Tree decomposition Minor Chordal graph Neighbourhood Graph Outerplanar graph Path decomposition Clique-sum Graph theory Graph operations Planar graphs
265	Author manuscript, published in "12th International Conference on Embedded Computer Systems: Architecture, Modeling and Simulation (SAMOS XII), Agios Konstantinos : Greece (2012)" Add to Reading List Source URL: hal.archives-ouvertes.fr Language: English - Date: 2012-07-27 05:20:18 Clique Graph Directed acyclic graph Neighbourhood Graph operations Path decomposition Edge coloring Graph theory NP-complete problems Graph coloring
266	Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal Daniel Lokshtanov∗ Add to Reading List Source URL: www.siam.org Language: English - Date: 2011-01-10 07:51:45 NP-complete problems Graph coloring Graph operations Path decomposition Tree decomposition Connectivity Graph List coloring Independent set Graph theory Theoretical computer science Mathematics
267	Nondeterministic Graph Searching: From Pathwidth to Treewidth Fedor V. Fomin1 , Pierre Fraigniaud2 , and Nicolas Nisse2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2007-01-17 10:04:40 Tree decomposition Branch-decomposition Minor Tree Connectivity Degree Directed graph Neighbourhood Cycle rank Graph theory Graph operations Path decomposition
268	Martin Grohe Descriptive Complexity, Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2013-11-22 16:46:10 Tree decomposition Minor Robertson–Seymour theorem Linkless embedding Path decomposition Graph structure theorem Graph theory Graph operations Planar graphs
269	(C[removed]Society for Industrial and Applied Mathematics SIAM J. Disc. MATH. Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2005-02-05 02:31:59 Tree Neighbourhood Graph Matching Outerplanar graph Path decomposition Planar separator theorem Graph theory Planar graphs Universal graph
270	State Spaces Graph Search Add to Reading List Source URL: www.cs.ubc.ca Language: English - Date: 2012-06-29 04:25:59 Graph Path decomposition Breadth-first search Graph theory Mathematics Theoretical computer science

UPDATE